A General Similarity Framework for Horn Clause Logic
نویسندگان
چکیده
منابع مشابه
A General Similarity Framework for Horn Clause Logic
First-Order Logic formulæ are a powerful representation formalism characterized by the use of relations, that cause serious computational problems due to the phenomenon of indeterminacy (various portions of one description are possibly mapped in different ways onto another description). Being able to identify the correct corresponding parts of two descriptions would help to tackle the problem: ...
متن کاملMeta-Programming for Generalized Horn Clause Logic
In conventional logic programming systems, control information is expressed by clause and goal order and by purely procedural constructs, e.g., the Prolog cut. This approach destroys the equivalence of declarative and procedural semantics in logic programs. In this paper, we argue that in order to comply with the logic programming paradigm, control information should also be expressed declarati...
متن کاملStructural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic
Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained ...
متن کاملTranslating a detailed linguistic semantic representation into Horn clause logic
From the semantic representation produced by TANKA, a domain-independent, knowledge-scant, and interactive natural language analyzer, we construct Horn clauses which represent the facts or rules found in technical texts, specifically legal texts. This article describes the conversion process and the way it takes into account the detailed structure returned by the analyzer, a precise syntacticse...
متن کاملOperational Semantics of Resolution in Horn Clause Logic
This paper presents a study of operational and type-theoretic properties of different resolution strategies in Horn clause logic. We distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by term-matching, the recently introduced structural resolution, and partial (or lazy) resolution. We express them all uniformly as abstract reduction systems, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2009
ISSN: 0169-2968
DOI: 10.3233/fi-2009-0004